µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
Àӽà ÀúÀå°ø°£À¸·Î½á Ç÷¡½Ã SSDÀÇ Á¤·Ä°ú Çؽà ¼º´É ºÐ¼® |
¿µ¹®Á¦¸ñ(English Title) |
Performance Analysis of Sort and Hash on the Flash SSD for Temporary Tablespace |
ÀúÀÚ(Author) |
±èÀç¸í
ÀÌ»ó¿ø
¹®ºÀ±â
Jaemyung Kim
Sangwon Lee
Bongki Moon
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 24 NO. 03 PP. 0058 ~ 0074 (2008. 12) |
Çѱ۳»¿ë (Korean Abstract) |
Áö³ 10³â°£ Ç÷¡½Ã ¸Þ¸ð¸®ÀÇ ÁýÀûµµ´Â ¸Å³â 2¹è¾¿ Áõ°¡ÇÏ¿´°í, ÀÌ ¼ºÀåÀº ¾ÕÀ¸·Î 5³â°£ Áö¼ÓµÉ °ÍÀ¸·Î ¿¹ÃøµÇ¸ç °ð Çϵåµð½ºÅ©¸¦ ´ëüÇÒ °æÀï·ÂÀ» °¡Áú °ÍÀ¸·Î º¸ÀδÙ. Ç÷¡½Ã SSD´Â Çϵåµð½ºÅ©¿Í ´Þ¸® ±â°èÀûÀÎ Áö¿¬ÀÌ ¾ø¾î ·£´ýÀб⠿¬»êÀ» ºü¸£°Ô ó¸®ÇÏ´Â ¹Ý¸é Çѹø µ¥ÀÌÅ͸¦ ¾²¸é µ¤¾î¾²Áö ¸øÇÏ¿© ·£´ý¾²±â ¼º´ÉÀÌ Å©°Ô ¶³¾îÁ® µ¥ÀÌÅÍ º£À̽º ½Ã½ºÅÛÀÇ ÀÏ¹Ý Å×ÀÌºí °ø°£¿¡ Àû¿ëÇÒ °æ¿ì ¼º´ÉÀÌ ÀúÇϵɼö ÀÖ´Ù. ÀÌ³í¹®¿¡¼´Â Ç÷¡½Ã SSD¸¦ »ó¿ë µ¥ÀÌÅͺ£À̽º ¼¹öÀÇ Àӽà Å×ÀÌºí °ø°£¿¡ Àû¿ëÇÏ¿© ¼º´ÉÀÌ Å©°Ô Çâ»óµÊÀ» ½ÇÇèÀ» ÅëÇØ È®ÀÎÇÏ°í, IO ÆÐÅÏÀ» ºÐ¼®ÇÏ¿© Ç÷¡½Ã SSD¿¡ ÀûÇÕÇÔÀ» º¸ÀδÙ. ´õºÒ¾î Ç÷¡½Ã SSD¸¦ È°¿ëÇÏ´Â °æ¿ì ÃÖÀûÀÇ IO ´ÜÀ§°¡ ¹Ù²î¾î¾ß ÇÏ°í, ¹öÆÛ °ø°£ ¶ÇÇÑ Å©°Ô Àý¾àÇÒ ¼ö ÀÖÀ½À» º¸ÀδÙ.
|
¿µ¹®³»¿ë (English Abstract) |
The densities of flash memory chips have been doubled for the last ten years, and it is estimated this trend will persist for the next five years. According to the trend, flash SSDs with price competitiveness can be used for database server in the near future. A flash SSD can process random read operation almost thousand times faster than a hard-disk, but its random write operation is slower due to its characteristic cannot overwrite data on the same place. In this reason, the database system using flash SSDs for ordinary tablespaces can be slower than that using hard disk drive in some conditions.
In this paper, we compare a flash SSD with a hard-disk as a temporary tablespace medium and analyze IO patterns when we perform major database operations such as an xternal-sort, sort-merge join, and hash join. We also redefine an optimal IO unit for an external-sort with a flash SSD including execution time in various IO units and buffer sizes.
|
Å°¿öµå(Keyword) |
Ç÷¡½ÃSSD
ÁúÀÇ Ã³¸®
Á¤·Ä
Á¤·Ä/º´ÇÕ Á¶ÀÎ
Çؽà Á¶ÀÎ
I/OÃÖÀûÈ
Flash SSD
Query Processing
Sot
Sort-Merge Join
Hash Join
I/O Optimization
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|